Logarithmic Time Scale

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-exponential Lifetime Extraction in Time-Logarithmic Scale

Methods are proposed for estimating real lifetimes and corresponding coefficients from realvalued measurement data in logarithmic scale, where the data are multi-exponential, i.e. represented by linear combinations of decaying exponential functions with various lifetimes. Initial approximations of lifetimes are obtained as peaks of the first derivative of the data, where the first derivative ca...

متن کامل

Logarithmic - Time Updates

Traditional databases commonly support eecient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take a rst step toward dynamic reasoning in probabilistic databases with comparable eeciency. We propose a dynamic data structure that supports eecient algorithms for updating and querying singly connected Bayesian networks....

متن کامل

Logarithmic Time Cost Optimal Parallel

When looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel sorting in the eld of theoretical computer science. Such \theoretical" algorithms are mainly described for the PRAM (Parallel Random Access Machine) model of computation 13, 26]. This paper shows h...

متن کامل

Logarithmic Time Online Multiclass prediction

We study the problem of multiclass classification with an extremely large numberof classes (k), with the goal of obtaining train and test time complexity logarith-mic in the number of classes. We develop top-down tree construction approachesfor constructing logarithmic depth trees. On the theoretical front, we formulate anew objective function, which is optimized at each node of...

متن کامل

Stochastic coalescence in logarithmic time

The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coalesce into one cluster via a decentralized stochastic process, where each round is as follows: Every cluster flips a fair coin to dictate whether it is to issue or accept requests in this round. Issuing a request amount...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wind Engineers, JAWE

سال: 2005

ISSN: 1883-8413,0912-1935

DOI: 10.5359/jawe.2005.421